Automorphism Groups of Primitive Distance-Bitransitive Graphs are Almost Simple
نویسندگان
چکیده
منابع مشابه
AUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS
An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...
متن کاملOn the automorphism groups of symmetric graphs admitting an almost simple group
This paper investigates the automorphism group of a connected and undirected G-symmetric graph Γ where G is an almost simple group with socle T . First we prove that, for an arbitrary subgroup M of AutΓ containing G, either T is normal in M or T is a subgroup of the alternating group Ak of degree k = |Mα : Tα| − |NM (T ) : T |. Then we describe the structure of the full automorphism group of G-...
متن کاملAutomorphism groups of graphs
These lecture notes provide an introduction to automorphism groups of graphs. Some special families of graphs are then discussed, especially the families of Cayley graphs generated by transposition sets. Keywords—Automorphism groups of graphs; Cayley graphs; transposition sets.
متن کاملDistance Transitive Graphs and Finite Simple Groups
This paper represents the first step in the classification of finite primitive distance transitive graphs. In it we reduce the problem to the case where the automorphism group is either almost simple or affine. Let ^ be a simple, connected, undirected graph with vertex set Q. If oc, /? e Q, then d(a, j8) denotes the distance between a and /3 in §. Let G be some group of automorphisms of §. Then...
متن کاملGeometric automorphism groups of graphs
Constructing symmetric drawings of graphs is NP-hard. In this paper, we present a new method for drawing graphs symmetrically based on group theory. More formally, we define an n-geometric automorphism group as a subgroup of the automorphism group of a graph that can be displayed as symmetries of a drawing of the graph in n dimensions. Then we present an algorithm to find all 2and 3-geometric a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1987
ISSN: 0195-6698
DOI: 10.1016/s0195-6698(87)80010-0